◀ Prev · Parts · Full · Next ▶

cite-note-1313. ↑ citerefbloom1970Bloom, Burton H. (July 1970). "Space/time trade-offs in hash coding with allowable errors". Communications of the ACM. 13 (7): 422–426. doi:10.1145/362686.362692. ISSN 0001-0782. S2CID 7931252.

cite-note-1414. ↑ citerefaragonseidel1989Aragon, C.R.; Seidel, R.G. (October 1989). "Randomized search trees". 30th Annual Symposium on Foundations of Computer Science. pp. 540–545. doi:10.1109/SFCS.1989.63531. ISBN 0-8186-1982-1.

cite-note-1515. ↑ Pugh, William (April 1989). Concurrent Maintenance of Skip Lists (PS, PDF) (Technical report). Dept. of Computer Science, U. Maryland. CS-TR-2222.

cite-note-1-1616. ↑ citerefalonspencer2016Alon, Noga; Spencer, Joel H. (2016). The probabilistic method (Fourth ed.). Hoboken, New Jersey: Wiley. ISBN 978-1-119-06195-3. OCLC 910535517.

◀ Prev · Parts · Full · Next ▶